#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    long long n; scanf("%lld",&n);
    long long l[100010] = {};
    long long ans = n;
    bool flag[100010] = {};
    for(int i = 1;i <= n;i++) scanf("%lld",&l[i]);
    sort(l+1,l+n+1);
    long long i = 1,j = 1;
    while(j <= n)
    {
        if(l[j] > l[i])
        {
            ans--;
            i++,j++;
        }
        else j++;
    }
    printf("%lld",ans);
    fclose(stdin);
    fclose(stdout);
    return 0;
}
